Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve
نویسندگان
چکیده
منابع مشابه
Approximating the epidemic curve
Many models of epidemic spread have a common qualitative structure. The numbers of infected individuals during the initial stages of an epidemic can be well approximated by a branching process, after which the proportion of individuals that are susceptible follows a more or less deterministic course. In this paper, we show that both of these features are consequences of assuming a locally branc...
متن کاملAn Improved Algorithm for the Approximation of a Cubic Bezier Curve and its Application for Approximating Quadratic Bezier Curve
In this paper an improved version of an earlier proposed algorithm for approximating cubic Bezier curve by a set of circular arcs is presented. It is investigated how the improved algorithm fits for approximation of quadratic Bezier curves. These issues occur in CAD/CAM systems during data exchange into data formats which do not support Bezier curves. Experimental results on examples, widely us...
متن کاملA Quasi Quadratic Time Algorithm for Hyperelliptic Curve Point Counting
We describe an algorithm to compute the cardinality of Jacobians of ordinary hyperelliptic curves of small genus over finite fields F2n with cost O(n ). This algorithm is derived from ideas due to Mestre. More precisely, we state the mathematical background behind Mestre’s algorithm and develop from it a variant with quasiquadratic time complexity. Among others, we present an algorithm to find ...
متن کاملA Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance
Given a digital curve and a maximum error, we propose an algorithm that computes a simplification of the curve such that the Fréchet distance between the original and the simplified curve is less than the error. The algorithm uses an approximation of the Fréchet distance, but a guarantee over the quality of the simplification is proved. Moreover, even if the theoretical complexity of the algori...
متن کاملA Curve Fitting Algorithm for Character Fonts
This paper presents an algorithm that automatically generates outline fonts from a grey-level image of a character obtained by a scanner. Our algorithm begins by extracting contour points from the image and dividing the points into a number of segments at the corner points. The next step is fitting a piecewise cubic Bézier curve to each segment. To fit cubic Bézier curves to segments, we use le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2005
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-005-1201-y